Geodetic Graphs Homeomorphic to a Given Geodetic Graph
نویسندگان
چکیده
This paper describes a new approach to the problem of generating the class of all geodetic graphs homeomorphic to a given geodetic one. An algorithmic procedure is elaborated to carry out a systematic finding of such a class of graphs. As a result, the enumeration of the class of geodetic graphs homeomorphic to certain Moore graphs has been performed.
منابع مشابه
Distinct edge geodetic decomposition in graphs
Let G=(V,E) be a simple connected graph of order p and size q. A decomposition of a graph G is a collection π of edge-disjoint subgraphs G_1,G_2,…,G_n of G such that every edge of G belongs to exactly one G_i,(1≤i ≤n). The decomposition 〖π={G〗_1,G_2,…,G_n} of a connected graph G is said to be a distinct edge geodetic decomposition if g_1 (G_i )≠g_1 (G_j ),(1≤i≠j≤n). The maximum cardinality of π...
متن کاملOn the edge geodetic and edge geodetic domination numbers of a graph
In this paper, we study both concepts of geodetic dominatingand edge geodetic dominating sets and derive some tight upper bounds onthe edge geodetic and the edge geodetic domination numbers. We also obtainattainable upper bounds on the maximum number of elements in a partitionof a vertex set of a connected graph into geodetic sets, edge geodetic sets,geodetic domin...
متن کاملSome remarks on the geodetic number of a graph
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between two not necessarily distinct vertices in D. The geodetic number of G is the minimum cardinality of a geodetic set of G. We prove that it is NP complete to decide for a given chordal or chordal bipartite graph G and a given integer k whether G has a geodetic set of cardinality at most k. Furthermore...
متن کاملA Generalization of Geodetic Graphs: K{Geodetic Graphs
An undirected graph G = (V;E) is said to be geodetic, if between any pair of vertices x; y 2 V there is a unique shortest path. Generalizations of geodetic graphs are introduced in this paper. K-geodetic graphs are de ned as graphs in which every pair of vertices has at most k paths of minimum length between them. Some properties and characterizations of k{geodetic graphs are studied.
متن کاملGeodetic spectra of graphs
Geodetic numbers of graphs and digraphs have been investigated in the literature recently. The main purpose of this paper is to study the geodetic spectrum of a graph. For any two vertices u and v in an oriented graph D, a u–v geodesic is a shortest directed path from u to v. Let I (u, v) denote the set of all vertices lying on a u–v geodesic. For a vertex subset A, let I (A) denote the union o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1611.01873 شماره
صفحات -
تاریخ انتشار 2016